New upper bounds for binary covering codes
نویسندگان
چکیده
Improved upper bounds are presented for K(n, r), the minimum cardinality of a binary code of length n and coveting radius r. The new bounds are obtained by both new and old constructions; in many of these, computer search using simulated annealing and tabu search plays a central role. Some new linear coveting codes are also presented. An updated table of upper bounds on K(n,r), n~<64, r~<12, is given.
منابع مشابه
On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes
We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tiett avv ainen 10] and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The new upper bound on the information rate is an...
متن کاملFurther results on the covering radius of codes
A number of upper and lower bounds are obtained for K( n, R), the minimal number of codewords in any binary code of length n and covering radius R. Several new constructions are used to derive the upper bounds, including an amalgamated direct sum construction for nonlinear codes. This construction works best when applied to normal codes, and we give some new and stronger conditions which imply ...
متن کاملNew multiple covering codes by tabu search
The problem of finding multiple coverings words) of the space is considered. of upper and lower bounds for such codes were et aI., Bounds for multiple covering codes, Des. Codes Cryptogr. 3 (1993), The new codes found in this work improve on 27 upper bounds in those tables. The codes were found using tabu search. The of this method is and it is shown how it also can be used to search for large ...
متن کاملOn the least covering radius of binary linear codes of dimension 6
In this work a heuristic algorithm for obtaining lower bounds on the covering radius of a linear code is developed. Using this algorithm the least covering radii of the binary linear codes of dimension 6 are determined. Upper bounds for the least covering radii of binary linear codes of dimensions 8 and 9 are derived.
متن کاملA new approach to the covering radius of codes
We introduce a new approach which facilitates the calculation of the covering radius of a binary linear code. It is based on determining the normalized covering radius p. For codes of fixed dimension we give upper and lower bounds on p that arc reasonably close. As an application, an explicit formula is given for the covering radius of an arbitrary code of dimension <4. This approach also sheds...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 178 شماره
صفحات -
تاریخ انتشار 1998